An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices
نویسندگان
چکیده
We derive an upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices using Markovian type counting arguments. The bound is expressed as the maximum of a nonlinear concave function over a finite-dimensional convex polytope of probability distributions. ∗Research supported by ONR MURI N00014-1-0637, DARPA grant No. N66001-00-C8062, and by NSF contract ECS 0123512.
منابع مشابه
Robust stability of fuzzy Markov type Cohen-Grossberg neural networks by delay decomposition approach
In this paper, we investigate the delay-dependent robust stability of fuzzy Cohen-Grossberg neural networks with Markovian jumping parameter and mixed time varying delays by delay decomposition method. A new Lyapunov-Krasovskii functional (LKF) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...
متن کاملNew Approach to Exponential Stability Analysis and Stabilization for Delayed T-S Fuzzy Markovian Jump Systems
This paper is concerned with delay-dependent exponential stability analysis and stabilization for continuous-time T-S fuzzy Markovian jump systems with mode-dependent time-varying delay. By constructing a novel Lyapunov-Krasovskii functional and utilizing some advanced techniques, less conservative conditions are presented to guarantee the closed-loop system is mean-square exponentially stable....
متن کاملOn the Exponent of Triple Tensor Product of p-Groups
The non-abelian tensor product of groups which has its origins in algebraic K-theory as well as inhomotopy theory, was introduced by Brown and Loday in 1987. Group theoretical aspects of non-abelian tensor products have been studied extensively. In particular, some studies focused on the relationship between the exponent of a group and exponent of its tensor square. On the other hand, com...
متن کاملApproximation of chaotic systems in terms of Markovian processes
We mimic the deterministic chaos appearing in low dimensional systems in terms of a product of suitable random matrices by considering Markov trials. From the high order Markovian processes it is possible to obtain a good approximation for the Lyapunov exponent and the decay rate of the correlation functions.
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 332 شماره
صفحات -
تاریخ انتشار 2005